Enumerating Maximal Bicliques from a Large Graph Using MapReduce
نویسندگان
چکیده
منابع مشابه
Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
We propose an output-sensitive algorithm for the enumeration of all maximal bicliques in a bipartite graph, tailored to the case when the degree distribution in one partite set is very skewed. We accomplish a worst-case bound better than previously known general bounds if, e.g., the degree sequence follows a power law.
متن کاملMining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes
We consider Maximal Clique Enumeration (MCE) from a large graph. A maximal clique is perhaps the most fundamental dense substructure in a graph, and MCE is an important tool to discover densely connected subgraphs, with numerous applications to data mining on web graphs, social networks, and biological networks. While effective sequential methods for MCE are known, scalable parallel methods for...
متن کاملEfficient Mining of Large Maximal Bicliques
Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicliques are not very efficient in practice. In this paper, we propose an efficient algorithm to mine large maximal biclique subgraphs from undirected graphs. Our algorithm uses a divide-and-conquer approach. It effectively uses t...
متن کاملIncremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
We consider incremental maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition of edges. When new edges are added to the graph, we seek to enumerate the change in the set of maximal bicliques, without enumerating the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without expl...
متن کاملDetecting Communities over Large Scale Graph Structure Data using MapReduce
With the appearances of the internet there is growing interest in executing analysis tasks over large scale graph structure data. This task includes processing of subgraph or multi-hop neighborhoods in graph. Examples of these graphs include identifying social circles, modified recommendation, Anomaly finding, link prediction and so on. These works are not well served by the vertex centric appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Services Computing
سال: 2017
ISSN: 1939-1374
DOI: 10.1109/tsc.2016.2523997